Generalized Perpendicular Bisector and exhaustive discrete circle recognition

نویسندگان

  • Eric Andres
  • Gaëlle Largeteau-Skapin
  • Marc Rodríguez
چکیده

This paper presents a generalization of the notion of circumcenter as the intersection of perpendicular bisectors. We define Generalized Perpendicular Bisectors between two regions as an area where each point is the center of at least one circle crossing both regions. This allows us to determine all the possible discrete circle centers that cross a given set of pixels. The possible radii can then easily be determined. This exhaustive digital circle parameter computation is adapted to various types of circles/digitization schemes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Properties and Applications of the Simplified Generalized Perpendicular Bisector

This paper deals with the Simplified Generalized Perpendicular Bisector (SGBP) presented in [1, 2]. The SGPB has some interesting properties that we explore. We show in particular that the SGPB can be used for the recognition and exhaustive parameter estimation of noisy discrete circles. A second application we are considering is the error estimation for a class of rotation reconstruction algor...

متن کامل

Generalized Perpendicular Bisector and Circumcenter

This paper presents a theoretical generalization of the circumcenter as the intersection of generalized perpendicular bisectors. We define generalized bisectors between two regions as an area where each point is the center of at least one circle crossing each of the two regions. These new notions should allow the design of new circle recognition algorithms.

متن کامل

Bisector Energy and Few Distinct Distances

We introduce the bisector energy of an n-point set P in R2, defined as E(P) = ∣∣{(a, b, c, d) ∈ P | a, b have the same perpendicular bisector as c, d}∣∣ . If no line or circle contains M(n) points of P, then we prove that for any ε > 0 E(P) = O ( M(n) 2 5n 12 5 +ε +M(n)n ) . We also derive the lower bound E(P) = Ω(M(n)n2), which matches our upper bound when M(n) is large. We use our upper bound...

متن کامل

On bisectors in normed planes

In this note, we completely describe the shape of the bisector of two given points in a two-dimensional normed vector space. More precisely, we show that, depending on the position of two given points with respect to the shape of the unit circle, the following holds: the bisector of a non-strict pair of points consists of two cones and a curve, which has properties similar to those of bisectors...

متن کامل

Study on Algorithms of Graphic Element Recognition for Precise Vectorization of Industrial Computed Tomographic Image

Circle, line and circular arc are the common basic graphic elements in industrial computed tomography (ICT) image. The algorithm of recognizing such elements is the key to industrial CT image precise vectorization. An industrial CT image vectorization system has been studied, including different recognition methods for these elements. Firstly, based on facet model, the sub-pixel edge of an indu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Graphical Models

دوره 73  شماره 

صفحات  -

تاریخ انتشار 2011